/**
* @author AlbertDarren
* @contact 2563491540@qq.com
*/
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctime>
using namespace std;
const int len=10,scope=20;
struct Node
{
    int x,y;
} ssd[len];
bool cmp(Node a,Node b)
{
    return a.x!=b.x?a.x>b.x:a.y<b.y;
}
int main_94()
{
    srand((unsigned int)time(nullptr));
    for (int i=0;i<len ;++i )
    {
        ssd[i]={rand()%scope,rand()%scope};
    }
    for (int i=0;i<len ;++i )
    {
        printf("x=%d \ty=%d\n",ssd[i].x,ssd[i].y);
    }
    printf("\n");
    sort(ssd,ssd+len,cmp);
    for (int i=0;i<len ;++i )
    {
        printf("x=%d \ty=%d\n",ssd[i].x,ssd[i].y);
    }
	return 0;
}
